Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions
نویسندگان
چکیده
for Invex Programs via Penalty Functions J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing 400065, China X. X. Huang School of Management, Fudan University, Shanghai 200433, China Abstract. In this paper, we apply the quadratic penalization technique to derive strong Lagrangian duality property for an inequality constrained invex program. Our results extend and improve the corresponding results in the literature.
منابع مشابه
A geometric framework for nonconvex optimization duality using augmented lagrangian functions
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a separation result for nonconvex sets via general concave surfaces. We use this separation result to provide necessary and sufficient conditions for establishing strong duality between geometric primal and dual problems...
متن کاملA Unified Augmented Lagrangian Approach to Duality and Exact Penalization
In this paper, the existence of an optimal path and its convergence to the optimal set of a primal problem of minimizing an extended real-valued function are established via a generalized augmented Lagrangian and corresponding generalized augmented Lagrangian problems, in which no convexity is imposed on the augmenting function. These results further imply a zero duality gap property between th...
متن کاملOn the augmented Lagrangian dual for integer programming
We consider the augmented Lagrangian dual for integer programming, and provide a primal characterization of the resulting bound. As a corollary, we obtain proof that the augmented Lagrangian is a strong dual for integer programming. We are able to show that the penalty parameter applied to the augmented Lagrangian term may be placed at a fixed, large value and still obtain strong duality for pu...
متن کاملCharacterization of Solutions of Nonsmooth Variational Problems and Duality
In this paper, we introduce a new class of nonsmooth pseudo-invex and nonsmooth quasi-invex functions to non-smooth variational problems. By using these concepts, numbers of necessary and sufficient conditions are established for a nonsmooth variational problem wherein Clarke’s generalized gradient is used. Also, weak, strong and converse duality are established. Keywords—Variational problem; N...
متن کاملA Parametric Approach to Non-Convex Optimal Control Problem
In this paper we have considered a non convex optimal control problem and presented the weak, strong and converse duality theorems. The optimality conditions and duality theorems for fractional generalized minimax programming problem are established. With a parametric approach, the functions are assumed to be pseudo-invex and v-invex.
متن کامل